package com.hspedu.newData.dmsxl.动态规划;


/**
 * @Author: yh
 * @description: 
 * @CreateTime: 2025-05-25 
 * @Version: 1.0
 */

public class LC1143最长公共子序列 {

    //todo
    public int longestCommonSubsequence(String text1, String text2) {

        char[] char1 = text1.toCharArray();
        char[] char2 = text2.toCharArray();

        int len1 = char1.length;
        int len2 = char2.length;

        int[][] dp = new int[len1+1][len2+1];

        for (int i = 1; i <= len1; i++) {
            char c1 = char1[i-1];
            for (int j = 1; j <= len2; j++) {
                char c2 = char2[j-1];

                if (c1==c2){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else {
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[len1][len2];
    }
}
